Pocklington’s Theorem and Bertrand’s Postulate
نویسنده
چکیده
The following propositions are true: (1) For all real numbers r, s such that 0 ≤ r and s · s < r · r holds s < r. (2) For all real numbers r, s such that 1 < r and r · r ≤ s holds r < s. (3) For all natural numbers a, n such that a > 1 holds an > n. (4) For all natural numbers n, k, m such that k ≤ n and m = b n2 c holds (n m ) ≥ (n k ) . (5) For all natural numbers n, m such that m = b n2 c and n ≥ 2 holds (n m ) ≥ 2n n . (6) For every natural number n holds (2·n n ) ≥ 4n 2·n . (7) For all natural numbers n, p such that p > 0 and n | p and n 6= 1 and n 6= p holds 1 < n and n < p.
منابع مشابه
A proof of Bertrand's postulate
We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime number theorem, his machinery, and in particular the two functions ψ and θ still play a central role in the modern development...
متن کاملAbout the Formalization of Some Results by Chebyshev in Number Theory
We discuss the formalization, in the Matita Interactive Theorem Prover, of a famous result by Chebyshev concerning the distribution of prime numbers, essentially subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime number theorem, his machinery, and in particular the two functions ψ and θ still play a central role in the mod...
متن کاملA truly elementary proof of Bertrand’s theorem
Bertrand’s theorem is a surprising conclusion of Newtonian mechanics, which states that only the attractive linear and inverse-square forces can yield closed, if bounded, orbits. (For an English translation of Bertrand’s paper, see Santos et al.; for a near-transcription of Bertrand’s proof using modern notation, see Greenberg.) Since the harmonic potential cannot be physically extended over as...
متن کاملRamanujan's Proof of Bertrand's Postulate
We present Ramanujan’s proof of Bertrand’s postulate and in the process, eliminate his use of Stirling’s formula. The revised proof is elegant and elementary so as to be accessible to a wider audience.
متن کاملOn the factorization of consecutive integers
A classical result of Sylvester [21] (see also [16], [17]), generalizing Bertrand’s Postulate, states that the greatest prime divisor of a product of k consecutive integers greater than k exceeds k. More recent work in this vein, well surveyed in [18], has focussed on sharpening Sylvester’s theorem, or upon providing lower bounds for the number of prime divisors of such a product. As noted in [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007